Formation of inclusion organoactinide complexes with boron-containing macrocycles

Reaction of the organoactinide complexes (C5Me5)2AnMe2 (An = Th, U) with catecholborane yields an inclusion complex where the actinide is encapsulated inside a 15-membered, hexaoxo, trianionic macrocycle built from alternating catechol and catecholborate fragments. In the presence of LiOH, a dimer of two encapsulated actinide macrocycles is formed. The X-ray molecular structure for all the complexes is presented.     

Experimental measurement of the strength of a C alpha-H...O bond in a lipid bilayer

Due to the apolar nature of the lipid bilayer, the weak Calpha-H...O H-bond is thought to contribute significantly toward the stability of transmembrane helical bundles such as glycophorin A (GPA). Here for the first time we measured the strength of such a bond, using vibrational frequency shifts of a dimeric and nondimeric variants of GPA containing a Gly CD2 label. Although the resulting estimated bond strength of 0.88 kcal/mol is relatively weak, several such bonds could contribute significantly toward bundle stabilization.     

Evolution of the mean instantaneous intensity in fibers affected by polarization mode dispersion

It is shown that the mean instantaneous intensity (MII) of a pulse propagating in an optical fiber affected by polarization mode dispersion is related to the frequency autocorrelation of the fiber's Jones matrix through a Fourier transform. A simple derivation of the diffusion equation satisfied by the MII and the autocorrelation function of a Jones matrix is described.     

Testing monotonicity over graph products

We consider the problem of monotonicity testing over graph products. Monotonicity testing is one of the central problems studied in the field of property testing. We present a testing approach that enables us to use known monotonicity testers for given graphs G₁, G₂, to test monotonicity over their product G₁ × G₂. Such an approach of reducing monotonicity testing over a graph product to monotonicity testing over the original graphs, has been previously used in the special case of monotonicity testing over [n]^d for a limited type of testers; in this article, we show that this approach can be applied to allow modular design of testers in many interesting cases: this approach works whenever the functions are boolean, and also in certain cases for functions with a general range. We demonstrate the usefulness of our results by showing how a careful use of this approach improves the query complexity of known testers. Specifically, based on our results, we provide a new analysis for the known tester for [n]^d which significantly improves its query complexity analysis in the low‐dimensional case. For example, when d = O(1), we reduce the best known query complexity from O(log ²n/ε) to O(log n/ε). © 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2008     

The Linear-Array Conjecture in Communication Complexity Is False

linear array network consists of k+1 processors with links only between and (0≤i<k). It is required to compute some boolean function f(x,y) in this network, where initially x is stored at and y is stored at . Let be the (total) number of bits that must be exchanged to compute f in worst case. Clearly, , where D(f) is the standard two-party communication complexity of f. Tiwari proved that for almost all functions and conjectured that this is true for all functions. In this paper we disprove Tiwari's conjecture, by exhibiting an infinite family of functions for which is essentially at most . Our construction also leads to progress on another major problem in this area: It is easy to bound the two-party communication complexity of any function, given the least number of monochromatic rectangles in any partition of the input space. How tight are such bounds? We exhibit certain functions, for which the (two-party) communication complexity is twice as large as the best lower bound obtainable this way. Received: March 1, 1996     

Electrospinning of ultrahigh‐molecular‐weight polyethylene nanofibers

The electrospinning method has been employed to fabricate ultrafine nanofibers of ultrahigh‐molecular‐weight polyethylene for the first time with a mixture of solvents of different dielectric constants and conductivities. The possibility of producing highly oriented nanofibers from ultrahigh‐molecular‐weight polymers suggests new ways of fabricating ultrastrong, porous, and single‐component nanocomposite fibers with improved properties. © 2007 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 45: 766–773, 2007     

Polyoxometalate-Engineered Building Blocks with Gold Cores for the Self-Assembly of Responsive Water-Soluble Nanostructures

The controlled assembly of gold nanoparticles (AuNPs) with the size of quantum dots into predictable structures is extremely challenging as it requires the quantitatively and topologically precise placement of anisotropic domains on their small, approximately spherical surfaces. We herein address this problem by using polyoxometalate leaving groups to transform 2 nm diameter gold cores into reactive building blocks with hydrophilic and hydrophobic surface domains whose relative sizes can be precisely tuned to give dimers, clusters, and larger micelle-like organizations. Using cryo-TEM imaging and ¹H DOSY NMR spectroscopy, we then provide an unprecedented “solution-state” picture of how the micelle-like structures respond to hydrophobic guests by encapsulating them within 250 nm diameter vesicles whose walls are comprised of amphiphilic AuNP membranes. These findings provide a versatile new option for transforming very small AuNPs into precisely tailored building blocks for the rational design of functional water-soluble assemblies.     

Flow auctions

Flow goods (like electricity) are sold through auctions in a dynamic framework. An important design question is the frequency of such auctions. We use a simple dynamic auction model in continuous time to answer this question. We focus on the relationship between the persistency of bidders’ valuations and the optimal choice of frequency. If the seller focuses on the equilibrium in which bidders follow a repeated static Nash strategy, then the frequency of auctions should typically increase when persistency declines. However, accounting for the fact that bidders can follow different equilibria that are collusive in nature, the comparative statics are reversed, forcing the seller to reduce the frequency when bidders’ valuations are less persistent. The argument builds on the fact that high frequency auctions are more conducive to collusion among bidders.